A Study of Scheduling in a Mold Manufacturing Cell
نویسنده
چکیده
As modern manufacturing plants tend to group their machinery in manufacturing cells for greater efficiency, a good scheduling technique within each cell is very critical in ensuring the smooth operation of the entire plant. With this in mind, this study is focused on scheduling jobs in a mold manufacturing cell. The present method involves many problems of coordination between departments and schedules used do not consider the optimality of the manufacturing cell. With the help of proper scheduling management, it is hoped that these problems will be eliminated and more efficient schedules are obtained. The goal of scheduling is often makespan or flow-time. However, in the manufacturing cell industries, priority weighted earliness with tardiness penalty might be more suitable in generating usable solutions. The branch and bound technique is used because of its enumerative and flexible nature. The algorithm was tested on real industrial manufacturing cell data and very promising schedules have been obtained.
منابع مشابه
A HYBRID GENETIC ALGORITHM FOR A BI-OBJECTIVE SCHEDULING PROBLEM IN A FLEXIBLE MANUFACTURING CELL
This paper considers a bi-objective scheduling problem in a flexible manufacturing cell (FMC) which minimizes the maximum completion time (i.e., makespan) and maximum tardiness simultaneously. A new mathematical model is considered to reflect all aspect of the manufacturing cell. This type of scheduling problem is known to be NP-hard. To cope with the complexity of such a hard problem, a genet...
متن کاملMeta heuristic for Minimizing Makespan in a Flow-line Manufacturing Cell with Sequence Dependent Family Setup Times
This paper presents a new mathematical model for the problem of scheduling part families and jobs within each part family in a flow line manufacturing cell where the setup times for each family are sequence dependent and it is desired to minimize the maximum completion time of the last job on the last machine (makespan) while processing parts (jobs) in each family together. Gaining an optimal s...
متن کاملScheduling Problem of Virtual Cellular Manufacturing Systems (VCMS); Using Simulated Annealing and Genetic Algorithm based Heuristics
In this paper, we present a simulated annealing (SA) and a genetic algorithm (GA) based on heuristics for scheduling problem of jobs in virtual cellular manufacturing systems. A virtual manufacturing cell (VMC) is a group of resources that is dedicated to the manufacturing of a part family. Although this grouping is not reflected in the physical structure of the manufacturing system, but machin...
متن کاملScheduling Problem of Virtual Cellular Manufacturing Systems (VCMS); Using Simulated Annealing and Genetic Algorithm based Heuristics
In this paper, we present a simulated annealing (SA) and a genetic algorithm (GA) based on heuristics for scheduling problem of jobs in virtual cellular manufacturing systems. A virtual manufacturing cell (VMC) is a group of resources that is dedicated to the manufacturing of a part family. Although this grouping is not reflected in the physical structure of the manufacturing system, but machin...
متن کاملA novel mathematical model for a hybrid flow shop scheduling problem under buffer and resource limitations-A case study
Scheduling problems play a big role in manufacturing and planning the production for increasing the production efficiency and assigning the resources to operations. Furthermore, in many manufacturing systems there is a physical space between stages that called intermediate buffers. In this study, a model is proposed for minimizing the makespan of a hybrid flow shop scheduling problem with inter...
متن کامل